- resource distribution algorithm
- қорды үлестіру алгоритмі
Ақпараттану мен есептеу техникасы терминдерінің қытайша-қазақша-ағылшынша-орысша сөздігі. - Үрімжі: Шынжаң ғылым-техника баспасы. Ережепұлы Қ.. 2010.
resource distribution algorithm
Look at other dictionaries:
CHAOS (Linux distribution) — infobox OS name = CHAOS caption = CHAOS 1.6 Boot Welcome Screen developer = Midnight Code / Ian Latter family = Linux source model = Open source latest release version = 1.6 latest release date = April 2005] working state = Currentcite web |… … Wikipedia
Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… … Wikipedia
Von Mises distribution — Probability distribution name =von Mises type =density pdf The support is chosen to be [ π,π] with μ=0 cdf The support is chosen to be [ π,π] with μ=0 parameters =mu real kappa>0 support =xin any interval of length 2π pdf =frac{e^{kappacos(x… … Wikipedia
Sequence step algorithm — The Sequence Step Algorithm (SQS AL) is an algorithm implemented in discrete event simulation system to maximize resource utlization. It uses sequence step which is a drawing concept in activity on node network to orderly determine repetitive… … Wikipedia
Noncentral t-distribution — Noncentral Student s t Probability density function parameters: degrees of freedom noncentrality parameter support … Wikipedia
Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… … Wikipedia
Commitment ordering — In concurrency control of databases, transaction processing (transaction management), and related applications, Commitment ordering (or Commit ordering; CO; (Raz 1990, 1992, 1994, 2009)) is a class of interoperable Serializability techniques … Wikipedia
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
Domain Name System Security Extensions — Internet protocol suite Application layer BGP DHCP DNS FTP HTTP … Wikipedia
Mathematics and Physical Sciences — ▪ 2003 Introduction Mathematics Mathematics in 2002 was marked by two discoveries in number theory. The first may have practical implications; the second satisfied a 150 year old curiosity. Computer scientist Manindra Agrawal of the… … Universalium
Long-tail traffic — This article covers a range of tools from different disciplines that may be used in the important science of determining the probability of rare events. The terms long range dependent , self similar and heavy tailed are very close in meaning.… … Wikipedia
